An exact Method for Stochastic Maximal Covering Problem of Preventive Healthcare Facilities

نویسندگان

چکیده مقاله:

Effective preventive healthcare services have a significant role in reducing fatality and medical expenses in all human societies and the level of accessibility of customers to these services can be considered as a measure of their efficiency and effectiveness. The main purpose of this paper is to develop a service network design model of preventive healthcare facilities with the principal objective of maximizing participation in the offered services. While considering utility constraints and incorporating demand elasticity of customers due to travel distance and congestion delays, optimal number, locations and capacities of facilities as well as customer assignment o facilities are determined. First, the primary nonlinear integer program is transformed, then the linearized model is solved by developing an exact algorithm. Computational results show that large-sized instances can be solved in a reasonable amount of time. An illustrative case study of network of hospitals in Shiraz, Iran, is used to demonstrate the model and the managerial insights are discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

General form of a cooperative gradual maximal covering location problem

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

متن کامل

Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

متن کامل

heuristic and exact algorithms for generalized bin covering problem

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

متن کامل

Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem

In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 10  شماره special issue on healthcare

صفحات  10- 23

تاریخ انتشار 2017-03-16

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023